Architecture and Finite Precision Optimization for Layered LDPC Decoders
نویسندگان
چکیده
منابع مشابه
High-throughput LDPC decoders
A high-throughput memory-efficient decoder architecture for low-density parity-check (LDPC) codes is proposed based on a novel turbo decoding algorithm. The architecture benefits from various optimizations performed at three levels of abstraction in system design—namely LDPC code design, decoding algorithm, and decoder architecture. First, the interconnect complexity problem of current decoder ...
متن کاملResource efficient LDPC decoders for multimedia communication
Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partial...
متن کاملLow Complexity, Flexible LDPC Decoders
The design and implementation of a flexible LDPC decoder able to cope with different codes, is gathering an increasing interest in the scientific community. Roughly speaking, a flexible decoder exhibits the remarkable ability of being able to decode different codes resorting to the same hardware. In this paper we present a novel decoder architecture specifically devised to present an high flexi...
متن کاملReduced-Latency and Area-Efficient Architecture for FPGA-Based Stochastic LDPC Decoders
This paper introduces a new field programmable gate array (FPGA) based stochastic low-density parity-check (LDPC) decoding process, to implement fully parallel LDPCdecoders. The proposed technique is designed to optimize the FPGA logic utilisation and to decrease the decoding latency. In order to reduce the complexity, the variable node (VN) output saturated-counter is removed and each VN inter...
متن کاملOn Generalized LDPC Codes and Their Decoders
We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity-check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nodes for which Riedel’s APP-decoder based on the reciprocal-dual code trellis becomes necessary. We then consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal Processing Systems
سال: 2011
ISSN: 1939-8018,1939-8115
DOI: 10.1007/s11265-011-0604-z